Answering N-chain Recursive Queries with Arithmetic
نویسندگان
چکیده
N-chain recursions are important because the majority of single-linear recursions can be compiled to N-chain recursions or so-called bounded recursions [8], which are not recursive at all. It appeared for some time [3, 5] that ALL single linear recursions could be converted to N-chain recursions. Although that is now known [13] to be inaccurate it is still clear that the most popular forms of SL recursion are amenable to N-chain evaluation. N-chain recursions are called Ndimensional stable recursive formulae in [13].
منابع مشابه
Anwering Recursive Queries under Keys and Foreign Keys is Undecidable
Query answering in the presence of integrity constraints is a fundamental problem in several settings, such as information integration. Keys, foreign keys and inclusion dependencies are the most common forms of constraints used in databases. It has been established recently that, in the presence of such constraints, query answering is decidable for non-recursive queries. Obviously, in the absen...
متن کاملQuery Rewriting for Horn-SHIQ Plus Rules
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite a given query to an equivalent SQL or Datalog query over a database associated with the ontology. This approach has been intensively studied for conjunctive query answering in the DL-Lite and EL families, but is much less explored fo...
متن کاملParallel Computation of Linear Recursive Queries in Knowledge-Based Systems
Parallel processing of recursive queries in KB systems is an important means to improve performance. However, two significant problems: heavy interprocessor communication and poor load balancing, are inherent features of query answering methods based on Least Fixed Point computation, such as Naive and Semi-Naive. They make it difficult to ensure efficiency for all distributions of data values. ...
متن کاملArithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential for parallel processing. It has advantages over other approaches using state-of-the-art parallel processing technology to improve processing speed. In the arithmetic approach, we identify two kind of parallelism, namely b...
متن کاملRecursive Query Plans for Data Integration
Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are actually stored in data sources. Previous solutions to the translation problem produced sets of conjunctive plans, and were therefore limited in their ability to handle recursive queries and to exploit data sources wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993